The Synchronizing Probability Function for Primitive Sets of Matrices
نویسندگان
چکیده
منابع مشابه
Primitive sets of nonnegative matrices and synchronizing automata
A set of nonnegative matricesM = {M1,M2, . . . ,Mk} is called primitive if there exist indices i1, i2, . . . , im such that Mi1Mi2 . . .Mim is positive (i.e. has all its entries > 0). The length of the shortest such product is called the exponent ofM. The concept of primitive sets of matrices comes up in a number of problems within control theory, non-homogeneous Markov chains, automata theory ...
متن کاملThe Synchronizing Probability Function of an Automaton
We study the synchronization phenomenon for deterministic finite state automata and the related longstanding Černý conjecture. We formulate this conjecture in the setting of a two-player probabilistic game. Our goal is twofold. On the one hand, the probabilistic interpretation is of interest in its own right and can be applied to real-world situations. On the other hand, our formulation makes u...
متن کاملThe Probability of Choosing Primitive Sets
We generalize a theorem of Nymann that the density of points in Z that are visible from the origin is 1/ζ(d), where ζ(a) is the Riemann zeta function P∞ i=1 1/i . A subset S ⊂ Z is called primitive if it is a Z-basis for the lattice Z ∩ spanR(S), or, equivalently, if S can be completed to a Z-basis of Z. We prove that if m points in Z are chosen uniformly and independently at random from a larg...
متن کاملanalysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولOn the Counting Function of Primitive Sets of Integers
Erdo s has shown that for a primitive set A/N a # A 1 (a log a)<const. This implies that A(x)<x (log log x log log log x) for infinitely many x. We prove that this is best possible apart from a factor (log log log x). 1999 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2020
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054120410051